Control flow analysis in schemeSHIVERS, Olin.ACM SIGPLAN notices. 2004, Vol 39, Num 4, pp 259-269, issn 1523-2867, 11 p.Article

Analyzing the environment structure of higher-order languages using frame stringsMIGHT, Matthew; SHIVERS, Olin.Theoretical computer science. 2007, Vol 375, Num 1-3, pp 137-168, issn 0304-3975, 32 p.Article

Modular Rollback through Control Logging: A Pair of Twin Functional PearlsSHIVERS, Olin; TURON, Aaron.ACM SIGPLAN notices. 2011, Vol 46, Num 9, pp 58-68, issn 1523-2867, 11 p.Conference Paper

Pushdown Flow Analysis of First-Class ControlVARDOULAKIS, Dimitrios; SHIVERS, Olin.ACM SIGPLAN notices. 2011, Vol 46, Num 9, pp 69-80, issn 1523-2867, 12 p.Conference Paper

Demand-driven type inference with subgoal pruning: Trading precision for scalabilitySPOON, S. Alexander; SHIVERS, Olin.Lecture notes in computer science. 2004, pp 51-74, issn 0302-9743, isbn 3-540-22159-X, 24 p.Conference Paper

Why Teach Programming LanguagesSHIVERS, Olin.ACM SIGPLAN notices. 2008, Vol 43, Num 11, pp 130-132, issn 1523-2867, 3 p.Conference Paper

Bottom-up β-reduction : Uplinks and λ-DAGsSHIVERS, Olin; WAND, Mitchell.Lecture notes in computer science. 2005, pp 217-232, issn 0302-9743, isbn 3-540-25435-8, 16 p.Conference Paper

Scheme and functional programmingFELLEISEN, Matthias; LAWALL, Julia; SERRANO, Manuel et al.Higher-order and symbolic computation. 2005, Vol 18, Num 3-4, issn 1388-3690, 147 p.Serial Issue

The anatomy of a loop : A story of scope and controlSHIVERS, Olin.ACM SIGPLAN notices. 2005, Vol 40, Num 9, pp 2-14, issn 1523-2867, 13 p.Conference Paper

Improving flow analyses via ΓΗCfA : Abstract garbage collection and countingMIGHT, Matthew; SHIVERS, Olin.ACM SIGPLAN notices. 2006, Vol 41, Num 9, pp 13-25, issn 1523-2867, 13 p.Conference Paper

Implementing metcast in schemeKISELYOV, Oleg.Higher-order and symbolic computation. 2005, Vol 18, Num 3-4, pp 355-370, issn 1388-3690, 16 p.Article

Static analysis for syntax objectsFISHER, David; SHIVERS, Olin.ACM SIGPLAN notices. 2006, Vol 41, Num 9, pp 111-121, issn 1523-2867, 11 p.Conference Paper

A variadic extension of Curry's fixed-point combinatorGOLDBERG, Mayer.Higher-order and symbolic computation. 2005, Vol 18, Num 3-4, pp 371-388, issn 1388-3690, 18 p.Article

Multi-return function callSHIVERS, Olin; FISHER, David.ACM SIGPLAN notices. 2004, Vol 39, Num 9, pp 79-89, issn 1523-2867, 11 p.Conference Paper

Integrating user-level threads with processes in ScshGASBICHLER, Martin; SPERBER, Michael.Higher-order and symbolic computation. 2005, Vol 18, Num 3-4, pp 327-354, issn 1388-3690, 28 p.Article

Continuations and transducer compositionSHIVERS, Olin; MIGHT, Matthew.ACM SIGPLAN notices. 2006, Vol 41, Num 6, pp 295-307, issn 1523-2867, 13 p.Conference Paper

BIT : A very compact scheme system for microcontrollersDUBE, Danny; FEELEY, Marc.Higher-order and symbolic computation. 2005, Vol 18, Num 3-4, pp 271-298, issn 1388-3690, 28 p.Article

Environment analysis via ΔCFAMIGHT, Matthew; SHIVERS, Olin.ACM SIGPLAN notices. 2006, Vol 41, Num 1, pp 127-140, issn 1523-2867, 14 p.Conference Paper

Fixing letrec : A faithful yet efficient implementation of Scheme's recursive binding constructWADDELL, Oscar; SARKAR, Dipanwita; DYBVIG, R. Kent et al.Higher-order and symbolic computation. 2005, Vol 18, Num 3-4, pp 299-326, issn 1388-3690, 28 p.Article

Selectors make set-based analysis too hardMEUNIER, Philippe; FINDLER, Robert Bruce; STECKLER, Paul et al.Higher-order and symbolic computation. 2005, Vol 18, Num 3-4, pp 245-269, issn 1388-3690, 25 p.Article